Simple existence conditions for zero-one matrices with at most one structural zero in each row and column
نویسنده
چکیده
We give simple necessary and sufficient conditions for the existence of a zero-one matrix with given row and column sums and at most one structural zero in each row and column. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
ZPC Matrices and Zero Cycles
Let H be an m × n real matrix and let Zi be the set of column indices of the zero entries of row i of H. Then the conditions |Zk ∩ ∪k−1 i 1 Zi | ≤ 1 for all k 2 ≤ k ≤ m are called the row Zero Position Conditions ZPCs . If H satisfies the ZPC, then H is said to be a row ZPC matrix. If H satisfies the ZPC, thenH is said to be a column ZPCmatrix. The real matrixH is said to have a zero cycle if H...
متن کاملOn the Existence of Sequences and Matrices With Prescribed Partial Sums of Elements
We prove necessary and sufficient conditions for the existence of sequences and matrices with elements in given intervals and with prescribed lower and upper bounds on the element sums corresponding to the sets of an orthogonal pair of partitions. We use these conditions to generalize known results on the existence of nonnegative matrices with a given zero pattern and prescribed row and column ...
متن کاملDeterminants of Certain Classes of Zero-One Matrices with Equal Line Sums
We study the possible determinant values of various classes of n×n zero-one matrices with fixed row and column sums. Some new results, open problems, and conjectures are presented.
متن کاملOn nest modules of matrices over division rings
Let $ m , n in mathbb{N}$, $D$ be a division ring, and $M_{m times n}(D)$ denote the bimodule of all $m times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m times n}(D)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $D$. Next, we introduce the notion of a nest module of matrices with entries from $D$. We ...
متن کاملEla Fast Computing of the Moore - Penrose Inverse Matrix
In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m× n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006